//输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。 
//
// 
//
// 示例 1： 
//
// 输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
//输出：[1,2,3,6,9,8,7,4,5]
// 
//
// 示例 2： 
//
// 输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
//输出：[1,2,3,4,8,12,11,10,9,5,6,7]
// 
//
// 
//
// 限制： 
//
// 
// 0 <= matrix.length <= 100 
// 0 <= matrix[i].length <= 100 
// 
//
// 注意：本题与主站 54 题相同：https://leetcode-cn.com/problems/spiral-matrix/ 
// Related Topics 数组 
// 👍 160 👎 0

package leetcode.editor.cn;
//Java：顺时针打印矩阵
public class ShunShiZhenDaYinJuZhenLcof{
    public static void main(String[] args) {
        Solution solution = new ShunShiZhenDaYinJuZhenLcof().new Solution();
        
    }
    
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int[] spiralOrder(int[][] matrix) {
        if ( matrix == null || matrix.length == 0 ){
            return new int[0];
        }
        //初始化四个边界
        int left = 0;
        int top = 0;
        int right = matrix[0].length - 1;
        int bottom = matrix.length -1;
        int k = 0;
        int[] answer = new int[matrix.length * matrix[0].length];
        while ( top <= bottom && left <= right ){
            //从左到右
            for (int i = left; i <= right ; i++) {
                answer[k++] = matrix[top][i];
            }
            top++;
            //从上到下
            for (int i = top; i <= bottom ; i++) {
                answer[k++] = matrix[i][right];
            }
            right--;
            //从右到左
            for (int i = right; i >= left && top <= bottom ; i--) {
                answer[k++] = matrix[bottom][i];
            }
            bottom--;
            //从下到上
            for (int i = bottom; i >= top && left <= right ; i--) {
                answer[k++] = matrix[i][left];
            }
            left++;
        }
        return answer;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}
